On the range of pinned random walks
نویسندگان
چکیده
منابع مشابه
Random walks with long-range self-repulsion on proper time
We introduce a model of self-repelling random walks where the short-range interaction between two elements of the chain decreases as a power of the difference in proper time. Analytic results on the exponent ν are obtained. They are in good agreement with Monte Carlo simulations in two dimensions. A numerical study of the scaling functions and of the efficiency of the algorithm is also presented.
متن کاملLong-Range Navigation on Complex Networks using Lévy Random Walks
We introduce a strategy of navigation in undirected networks, including regular, random, and complex networks, that is inspired by Lévy random walks, generalizing previous navigation rules. We obtained exact expressions for the stationary probability distribution, the occupation probability, the mean first passage time, and the average time to reach a node on the network. We found that the long...
متن کاملA PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کاملModerate deviations for the range of planar random walks
Given a symmetric random walk in Z2 with finite second moments, let Rn be the range of the random walk up to time n. We study moderate deviations for Rn −ERn and ERn−Rn. We also derive the corresponding laws of the iterated logarithm.
متن کاملRandom Walks on Random Graphs
The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs. Given a graphG = (V,E), let dG(v) denote the degree of vertex v for all...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tohoku Mathematical Journal
سال: 2006
ISSN: 0040-8735
DOI: 10.2748/tmj/1163775134